Operational Semantics of Transactions
نویسندگان
چکیده
Mathematics is forcing towards a consistent framework of theory development. Computer Science is an engineering discipline and sometimes suffers from ad-hoc definitions. Transactions are a concept that is commonly used in the database area. It is often defined in the form: given a syntactic construct in an abstract form and declare a number of properties an engine should support which is not specified and invisible. This paper aims in providing an operational semantics for transactions. A DBMS implementation is then considered to be a faithful refinement of the operational semantics.
منابع مشابه
A Composable Mixed Mode Concurrency Control Semantics for Transactional Programs
Most software transactional memories employ optimistic concurrency control. A pessimistic semantics, however, is not without its benefits: its programming model is often much simpler to reason about and supports the execution of irreversible operations. We present a programming model that supports both optimistic and pessimistic concurrency control semantics. Our pessimistic transactions, guara...
متن کاملNested Transactions in a Logical Language for Active Rules Institut F Ur Informatik | Report 80 ?
We present a hierarchically structured transaction-oriented concept for a rule-based active database system. In LL94, LHL95], we have proposed Statelog as a uniied framework for active and deductive rules. Following the need for better structuring capabilities , we introduce procedures as a means to group semantically related rules and to encapsulate their behavior. In addition to executing ele...
متن کاملNested Transactions in a Logical Language for Active Rules
We present a hierarchically structured transaction oriented concept for a rule based active database system In LL LHL we have proposed Statelog as a uni ed framework for active and deductive rules Following the need for better structuring capabilities we intro duce procedures as a means to group semantically related rules and to encapsulate their behavior In addition to executing elementary upd...
متن کاملExecutable Semantics for Compensating CSP
Compensation is an error recovery mechanism for long-running transactions. Compensating CSP is a variant of the CSP process algebra with constructs for orchestration of compensations. We present a simple operational semantics for Compensating CSP and outline an encoding of this semantics in Prolog. This provides a basis for implementation and model checking of the language.
متن کامل